Parallel Standard Cell Place- Ment Algorithms with Quality Equivalent to Simulated Annealing. Ieee Transac- Tions On
نویسنده
چکیده
39 { Introduce algorithms to keep errors within a constant factor of the temperature. Use x5 and x6 to help estimate the factor. { Increase the number of annealing steps performed at each temperature to compensate for errors. Use x6.3 to help estimate the number of steps. { Weigh the performance beneets of parallelism or sloppy computations against the increased annealing steps to obtain the same quality. Inaccuracies can even degrade the total execution time, when considered in this light. Acknowledgements.
منابع مشابه
Parallel standard cell placement algorithms with quality equivalent to simulated annealing
Parallel algorithms with quality equivalent to the simulated annealing placement algorithm for standard cells [23] are presented. The first, called heuristic spanning, creates parallelism by simultaneously investigating different areas of the plausible combinatorial search space. It is used to replace the high temperature portion of simulated annealing. The low temperature portion of Simulated ...
متن کاملA Parallel Row - Based Algorithm with Error Control for Standard - Cell Placement on a Hypercube Multiprocessor
A ncw row-bas& panllcl algorithm for standard-ccll placement targeted for execution on a hypercube multiprocessor is prescntcd. Key fcatures of this implementation include a dynamic simulated-annealing schcdule, row-partitioning of the VLSI chip image, and two novel new approaches to controlling error in parallel ccll-placemcnt algorithms: Heuristic Cell-Coloring and Adaptive (Parallel Move) Se...
متن کاملAn evaluation of parallel simulated annealing strategies with application to standard cell placement
Simulated annealing, a methodology for solving combinatorial optimization problems, is a very computationally expensive algorithm, and as such, numerous researchers have undertaken efforts to parallelize it. In this paper, we investigate three of these parallel simulated annealing strategies when applied to standard cell placement, specifically the TimberWolfSC placement tool. We have examined ...
متن کاملHybrid artificial immune system and simulated annealing algorithms for solving hybrid JIT flow shop with parallel batches and machine eligibility
This research deals with a hybrid flow shop scheduling problem with parallel batching, machine eligibility, unrelated parallel machine, and different release dates to minimize the sum of the total weighted earliness and tardiness (ET) penalties. In parallel batching situation, it is supposed that number of machine in some stages are able to perform a certain number of jobs simultaneously. First...
متن کاملParallel simulated annealing strategies for VLSI cell placement
Simulated annealing based standard cell placement for VLSI designs has long been acknowledged as a compute-intensive process, and as a result several research efforts have been undertaken to parallelize this algorithm. Most previous parallel approaches to cell placement annealing have used a parallel moves approach. In this paper we investigate two new approaches that have been proposed for gen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994